Finite Automata, Palindromes, Powers, and Patterns
نویسندگان
چکیده
Given a language L and a nondeterministic finite automaton M , we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given thatM accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the nonpalindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), and words matching a general pattern.
منابع مشابه
N ov 2 00 7 Finite Automata , Palindromes , Patterns , and Borders
Given a language L and a nondeterministic finite automaton M , we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, t...
متن کاملPostselection Finite Quantum Automata
Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملThree-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs
Inoue et al. introduced an automaton on a twodimensional tape, which decides acceptance or rejection of an input tape by scanning the tape from various sides by various automata which move one way, and investigated the accepting power of such an automaton. This paper continues the investigation of this type of automata, especially, ∨-type automata (obtained by combining four three-way two-dimen...
متن کاملComplexity Bounds of Constant-Space Quantum Computation
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In particular, we show that, when the automata halt “in finite steps” along all computation paths, they must terminate in worstcase liner time. In the bounded-erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008